A Lightweight and Attack Resistant Authenticated Routing Protocol for Mobile Adhoc Networks

In mobile ad hoc networks, by attacking the corresponding routing protocol, an attacker can easily disturb the operations of the network. For ad hoc networks, till now many secured routing protocols have been proposed which contains some disadvantages. Therefore security in ad hoc networks is a controversial area till now. In this paper, we proposed a Lightweight and Attack Resistant Authenticated Routing Protocol (LARARP) for mobile ad hoc networks. For the route discovery attacks in MANET routing protocols, our protocol gives an effective security. It supports the node to drop the invalid packets earlier by detecting the malicious nodes quickly by verifying the digital signatures of all the intermediate nodes. It punishes the misbehaving nodes by decrementing a credit counter and rewards the well behaving nodes by incrementing the credit counter. Thus it prevents uncompromised nodes from attacking the routes with malicious or compromised nodes. It is also used to prevent the denial-of-service (DoS) attacks. The efficiency and effectiveness of LARARP are verified through the detailed simulation studies.Comment: 14 Pages, IJWM

The Hydrodynamical Limit of Quantum Hall system

We study the current algebra of FQHE systems in the hydrodynamical limit of small amplitude, long-wavelength fluctuations. We show that the algebra simplifies considerably in this limit. The hamiltonian is expressed in a current-current form and the operators creating inter-Landau level and lowest Landau level collective excitations are identified.Comment: Revtex, 16 page

Natural Gauge Hierarchy in SO(10)

It is shown that a natural gauge hierarchy and doublet-triplet splitting can be achieved in SO(10) using the Dimopoulos-Wilczek mechanism. Artificial cancellations (fine-tuning) and arbitrary forms of the superpotential are avoided, the superpotential being the most general compatible with a symmetry. It is shown by example that the Dimopoulos-Wilczek mechanism can be protected against the effects of higher-dimension operators possibly induced by Planck-scale physics. Natural implementation of the mechanism leads to an automatic Peccei-Quinn symmetry. The same local symmetries that would protect the gauge hierarchy against Planck-scale effects tend to protect the axion also. It is shown how realistic quark and lepton masses might arise in this framework. It is also argued that ``weak suppression'' of proton decay can be implemented more economically than can ``strong suppression'', offering some grounds to hope (in the context of SO(10)) that proton decay could be seen at Superkamiokande.Comment: 26 pages in plain LaTeX, 5 figures available on request, BA-94-0

Factors determining spawning success in Penaeus monodon Fabricius

Spawning success in relation to the size of spawner, clumping of eggs, percentage of spawning and frequency of spawning was studied in Penaeus monodon collected off Tamil Nadu, India. The results indicated positive correlation between the size of spawner and the fecundity and hatching percentage, but not the start of hatching. Hatching characteristics were influenced by clumping of eggs or abortive spawning; the greater the clumping, the longer the time taken for hatching, resulting in a lower hatching percentage. The start of hatching time increased when the frequency of spawning increased. Lower hatching rate was observed as the frequency of spawning increased

Analysis of melt-textured YBCO with nanoscale inclusions

Recently, particles with the chemical composition Y2Ba 4CuMOx where M U, Nb, Zr, etc., and sizes in the range of 50 - 200 nm have been generated within the YBCO matrix of bulk, melt-processed superconductors in order to serve as effective flux pinning sites. By means of AFM and electron backscatter diffraction (EBSD) measurements, we analyse the spatial distribution and the size distribution of these nanoparticles within the superconducting YBCO matrix

Classifying pairs with trees for supervised biological network inference

Networks are ubiquitous in biology and computational approaches have been largely investigated for their inference. In particular, supervised machine learning methods can be used to complete a partially known network by integrating various measurements. Two main supervised frameworks have been proposed: the local approach, which trains a separate model for each network node, and the global approach, which trains a single model over pairs of nodes. Here, we systematically investigate, theoretically and empirically, the exploitation of tree-based ensemble methods in the context of these two approaches for biological network inference. We first formalize the problem of network inference as classification of pairs, unifying in the process homogeneous and bipartite graphs and discussing two main sampling schemes. We then present the global and the local approaches, extending the later for the prediction of interactions between two unseen network nodes, and discuss their specializations to tree-based ensemble methods, highlighting their interpretability and drawing links with clustering techniques. Extensive computational experiments are carried out with these methods on various biological networks that clearly highlight that these methods are competitive with existing methods.Comment: 22 page